Hodge Theoretic Reward Allocation for Generalized Cooperative Games on Graphs

نویسندگان

چکیده

We define cooperative games on general graphs and generalize Lloyd S. Shapley's celebrated allocation formula for those in terms of stochastic path integral driven by the associated Markov chain each graph. then show that value operator, one player defined integral, coincides with player's component game which is solution to least squares (or Poisson's) equation, light combinatorial Hodge decomposition weighted graphs. Several motivational examples applications are also presented.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Closed-Form Formula for the Fair Allocation of Gains in Cooperative N-Person Games

Abstract   This paper provides a closed-form optimal solution to the multi-objective model of the fair allocation of gains obtained by cooperation among all players. The optimality of the proposed solution is first proved. Then, the properties of the proposed solution are investigated. At the end, a numerical example in inventory control environment is given to demonstrate the application and t...

متن کامل

Allocation processes in cooperative games

In this paper we attempt to introduce dynamics into the theory of cooperative games. A solution of the game is reached through an allocation process. At each stage of the allocation process of a cooperative game a budget of fixed size is distributed among the players. In the first part of this note we study a type of process that, at any stage, endows the budget to a player whose contribution t...

متن کامل

Hodge Laplacians on graphs

This is an elementary introduction to the Hodge Laplacian on a graph, a higher-order generalization of the graph Laplacian. We will discuss basic properties including cohomology and Hodge theory. At the end we will also discuss the nonlinear Laplacian on a graph, a nonlinear generalization of the graph Laplacian as its name implies. These generalized Laplacians will be constructed out of coboun...

متن کامل

On Generalized Coprime Graphs

Paul Erdos defined the concept of coprime graph and studied about cycles in coprime graphs. In this paper this concept is generalized and a new graph called Generalized coprime graph is introduced. Having observed certain basic properties of the new graph it is proved that the chromatic number and the clique number of some generalized coprime graphs are equal.

متن کامل

Linear and symmetric allocation methods for partially defined cooperative games

A partially defined cooperative game is a coalition function form game in which some of the coalitional worths are not known. An application would be cost allocation of a joint project among so many players that the determination of all coalitional worths is prohibitive. This paper generalizes the concept of the Shapley value for cooperative games to the class of partially defined cooperative g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Social Science Research Network

سال: 2022

ISSN: ['1556-5068']

DOI: https://doi.org/10.2139/ssrn.3998070